Unified Architectures for Parallel Cyclic Convolution and Reduced Complexity Parallel FIR Filtering
نویسنده
چکیده
Novel recursive formulations of Block Pseudocirculant Matrices, which are reordered using stride permutations, lead to fully structured higher order Block Pseudocirculants, termed Super Block Pseudocirculant Matrices. These matrices provide a unified framework to develop highly modular parallel cyclic convolution architectures as well as to develop reduced complexity parallel FIR filtering constructs. These architectures can be considered duals of each other in the cyclic and linear (FIR) convolution contexts respectively. The proposed approach is easily scalable, highly modular, and unifies both architectures through a matrix-based universal technique that provides further theoretical understanding and gives additional flexibility to the designer.
منابع مشابه
Area- Power Efficient Parallel Fir Digital Filter Structures for Symmetric Convolutions Based on Fast Fir Algorithm D.aravindaraj
Based on a fast finite-impulse response (FIR) algorithms (FFAs), this paper proposes new parallel FIR filter structures, which are beneficial to symmetric coefficients in terms of the hardware cost, under the condition that the number of taps is a multiple of 2 or 3. In this work we present the radixfeed forward FFT architectures. The paper shows that radixcan be used for any number of parallel...
متن کاملFPGA Design of Parallel Linear-Phase FIR Digital Filter Using Distributed Arithmetic Algorithm
Based on fast FIR algorithms (FFAs), we propose distributed arithmetic algorithm based new parallel FIR filter architectures, which are beneficial to symmetric convolutions in terms of the hardware cost. Multipliers are the major portions in hardware consumption for the parallel FIR filter implementation. The proposed new structures exploit the nature of symmetric coefficients of odd length and...
متن کاملUsing multirate architectures in realizing quadratic Volterra kernels
Multirate architectures have been used for realizing linear FIR digital filters with reduced computational complexity. The Volterra kernel can be represented as a generalized convolution. It would thus be expected that multirate architectures could be used to advantage in realizing Volterra kernels as well. The quadratic Volterra kernel may be realized in the form of an “LDL structure.” The LDL...
متن کاملParallel Discrete Fourier Transform for Fast FIR Filtering Based on Overlapped-save Block Structure
To successfully provide a fast FIR filter with FTT algorithms, overlapped-save algorithms can be used to lower the computational complexity and achieve the desired real-time processing. As the length of the input block increases in order to improve the efficiency, a larger volume of zero padding will greatly increase the computation length of the FFT. In this paper, we use the overlapped block ...
متن کاملA Novel Fast FIR Algorithm for Area-Efficient Parallel FIR Digital Filter Structures Utilizes Symmetric Convolutions
Based on fast finite-impulse response (FIR) algorithms (FFAs), this paper proposes new parallel FIR filter structures, which are beneficial to symmetric coefficients in terms of the hardware cost, under the condition that the number of taps is a multiple of 2 or 3. The proposed parallel FIR structures exploit the inherent nature of symmetric coefficients reducing half the number of multipliers ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008